A new criterion on normal bases of finite field extensions

نویسندگان

  • Aixian Zhang
  • Keqin Feng
چکیده

A new criterion on normal bases of finite field extension Fqn/Fq is presented and explicit criterions for several particular finite field extensions are derived from this new criterion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic periods for finite fields

We construct two new families of basis for finite field extensions. Bases in the first family, the so-called elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the so-called normal elliptic bases are normal bases and allow fast (quasi-linear) arithmetic. We prove that all exte...

متن کامل

Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases

The deterministic factorization algorithm for polynomials over finite fields that was recently introduced by the author is based on a new type of linearization of the factorization problem. The main ingredients are differential equations in rational function fields and normal bases of field extensions. For finite fields of characteristic 2, it is known that this algorithm has several advantages...

متن کامل

On ^-regular Extensions of Local Fields1

1. Let A be a complete field with respect to a discreet valuation,2 and suppose that the residue class field of K is finite and has characteristic p. A group which is finite and whose order is not divisible by p is said to be ^-regular. A normal extension of A whose Galois group is ^-regular will be called a ^-regular extension of K. The object of this paper is to characterize those groups whic...

متن کامل

Construction of self-dual normal bases and their complexity

Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of selfdual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show t...

متن کامل

Finite field arithmetic using quasi-normal bases

Efficient multiplication in finite fields Fqn requires Fq-bases of low density,i.e., such that the products of the basis elements have a sparse expression in the basis. In this paper we introduce a new family of bases: the quasi-normal bases. These bases generalize the notion of normal bases and provide simple exponentiation to the power q in Fqn . For some extension fields Fqn over Fq, we cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2015